منابع مشابه
Propagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملfitting growth regression model to the boolean random sets
one of the models that can be used to study the relationship between boolean random sets and explanatory variables is growth regression model which is defined by generalization of boolean model and permitting its grains distribution to be dependent on the values of explanatory variables. this model can be used in the study of behavior of boolean random sets when their coverage regions variation...
متن کاملPartitioning Pairs of Countable Sets
We make the translations of our partitions from [3] in the context of all countable subsets of a fixed uncountable set. A different translation was obtained recently by Velleman [4]. The purpose of this paper is to define a two-cardinal version of one of our partitions from [3]. K 2 Theorem. For every uncountable set A there is a c : [[A] °] —► A such that, for every cofmal U Ç [A] ° and a in A...
متن کاملpropagation models and fitting them for the boolean random sets
in order to study the relationship between random boolean sets and some explanatory variables, this paper introduces a propagation model. this model can be applied when corresponding poisson process of the boolean model is related to explanatory variables and the random grains are not affected by these variables. an approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملDecomposition of polynomial sets into characteristic pairs
A characteristic pair is a pair (G, C) of polynomial sets in which G is a reduced lexicographic Gröbner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide representations for the zero set of P in term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2000
ISSN: 0021-8693
DOI: 10.1006/jabr.2000.8335